Constrained-Space Optimization and Reinforcement Learning for Complex Tasks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Data Modeling and Dynamic Optimization using Constrained Reinforcement Learning

In this paper, we address the problem of tightly integrating data modeling and decision optimization, particularly when the optimization is dynamic and involves a sequence of decisions to be made over time. We propose a novel approach based on the framework of constrained Markov Decision Processes, and establish some basic properties concerning modeling/optimization methods within this formulat...

متن کامل

Firefly Algorithm for Continuous Constrained Optimization Tasks

The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The first part of the paper is devoted to the detailed description of the existing algorithm. Then some suggestions for extending the si...

متن کامل

Common Subspace Transfer for Reinforcement Learning Tasks

Agents in reinforcement learning tasks may learn slowly in large or complex tasks — transfer learning is one technique to speed up learning by providing an informative prior. How to best enable transfer between tasks with different state representations and/or actions is currently an open question. This paper introduces the concept of a common task subspace, which is used to autonomously learn ...

متن کامل

Two Steps Reinforcement Learning in Continuous Reinforcement Learning Tasks

Two steps reinforcement learning is a technique that combines an iterative refinement of a Q function estimator that can be used to obtains a state space discretization with classical reinforcement learning algorithms like Q-learning or Sarsa. However, the method requires a discrete reward function that permits learning an approximation of the Q function using classification algorithms. However...

متن کامل

Safety-Constrained Reinforcement Learning for MDPs

We consider controller synthesis for stochastic and partially unknown environments in which safety is essential. Specifically, we abstract the problem as a Markov decision process in which the expected performance is measured using a cost function that is unknown prior to run-time exploration of the state space. Standard learning approaches synthesize cost-optimal strategies without guaranteein...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Robotics and Automation Letters

سال: 2020

ISSN: 2377-3766,2377-3774

DOI: 10.1109/lra.2020.2965392